On Maximizing Reliability of Network Topology Design Using a Practical Dynamic Programming Approach
نویسندگان
چکیده
منابع مشابه
A Practical Approach for Network Topology Discovery
This paper proposes a practical approach for discovering the network topology within an administrative domain. Two discovery algorithms, network layer discovery algorithm and link layer discovery algorithm, are presented in the paper. Network layer discovery algorithm generates the network layer topology within the domain which displays the relationship among subnets. Because the devices and th...
متن کاملA dynamic bi-objective model for after disaster blood supply chain network design; a robust possibilistic programming approach
Health service management plays a crucial role in human life. Blood related operations are considered as one of the important components of the health services. This paper presents a bi-objective mixed integer linear programming model for dynamic location-allocation of blood facilities that integrates strategic and tactical decisions. Due to the epistemic uncertain nature of ...
متن کاملStudy on implementation of one-piece lean line design using simulation techniques: A practical approach
This paper discusses the simulation study carried out for proposing one-piece lean line layout with features of Lean Manufacturing. The lean initiatives that can be addressed are, introducing Kanban replenishment sys-tem, better work-in-process, changing the layout, visual management techniques, standardized work for the re-duction of cycle time, number of workers, number of setups. To improve ...
متن کاملA Practical Algorithm for Reliable Network Topology Design
This paper addresses an NP-hard problem of designing a network topology with maximum (s, t) reliability subject to given constraints, such as the computer centers location (nodes), their connecting links reliability and cost, and the maximum budget cost to install the links. Cost is a major issue in the network design, and thus the problem is applicable for networks requiring maximized reliabil...
متن کاملNote on Practical Dynamic Programming
Since we convert the original sequential problem into a collection of small problems, it is important to make sure that the solution to each of the small problems is actually optimal in the original problem. In other words, the optimal choice in each of the two-period problem must be globally optimal to justify the transformation. Richard Bellman, the inventor of the dynamic programming method,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Modern Applied Science
سال: 2018
ISSN: 1913-1852,1913-1844
DOI: 10.5539/mas.v12n12p163